Analysis and Design of Cognitive Radio Networks Using Game Theory
	Supermodular Game	next	home

Potential Games

Potentail Games:Existence of a function (called the potential function, V), that reflects the change in utility seen by a unilaterally deviating player.

Because of the ease of verifying that a cognitive radio algorithm satisfies the conditions of a potential game (as simple as evaluating a second-order derivative), the readily
identified equilibria, and the broad class of low complexity algorithms are guaranteed to converge to stable equilibria, the potential game model is particularly attractive for the
design of cognitive radio algorithms. The primary limitation of designing cognitive radio algorithms with potential games is that loner radio networks cannot be assured of
desirable performance.

This concept an be refined into the following five fundamental classes of potential games: exact potential games, weighted potential games, ordinal potential games, generalized

ordinal potential games, and eneralized		-potential games

definition(5-1-1):

example1: Exact Potential Games(EPG)

	exact potential function, V, which satisfies in

definition(5-1-2)

example2: Weighted Potential Games(WPG)

	Weighted potential function, V, which satisfies in

definition(5-1-3)

example3: Ordinal Potential Games(OPG)

	Ordinal potential function, V, which satisfies in

definition(5-1-4)

example4: Ordinal Potential Games(GOPG)

definition(5-1-5)

table(5-1): type of potential games

Relationships between Potential Game Classes

every exact potential game is a weighted potential game; every weighted potential game is an ordinal potential game; and every ordinal potential game is a generalized ordinal potential game.

theorem(5-1-1)

Figure 5.1: Potential Game Venn Diagram